Analysis of network performance

ABSTRACT

Methods and apparatus are disclosed for analysing network performance of a network comprising a plurality of network nodes. The method may comprise: obtaining a plurality of probe measurements in respect of a target node, the probe measurements resulting from probe test-messages being sent via different network paths to said target node and relating to a network performance characteristic in respect of the paths taken by the respective probe test-messages and probe response-messages associated therewith and being dependent also on local processing of the respective probe test-messages at said target node; determining respective measures of unexpectedness in respect of the probe measurements; comparing said respective measures of unexpectedness and in dependence on the comparison, assigning a weighting in respect of said target node; and determining a network performance analysis measure in dependence on at least one probe measurement and on the weighting.

TECHNICAL FIELD

The present invention relates to data networks, and to methods and apparatus for analysing performance in respect of data networks. In particular, embodiments thereof relate to ways of analysing or testing network performance in respect of digital data networks such as the Internet, a corporate network, a data centre or a local network using data items such as data packets or other such messages.

BACKGROUND TO THE INVENTION AND PRIOR ART

Analysing networks in order to obtain measurements indicative of network performance can be done using various techniques, including techniques involving active testing (in which traffic is sent over a network specifically for the purpose of conducting tests) and techniques involving passive testing (in which traffic already flowing across a network due to user activity is analysed).

Techniques involving passive testing can show performance of real applications as used by real users, but are generally limited to testing applications and networks being used at a particular time, and can make it hard to compare network performance since the traffic over which tests are being applied varies. Active testing using reference traffic sent across the network does not generally have this disadvantage.

Techniques involving active testing also have problems in what can be tested, however. Typically, active testing techniques either test services themselves (e.g. web page or video performance), or the underlying network. Testing is generally performed from a test-point to a service or to a test-server located in the network. By using multiple test-servers, network operators can get a view of performance across different paths or sub-paths of the network, but it is expensive to deploy and maintain test-servers on a large scale, and this may not give views of networks not under the operator's control unless test-servers are sited within them. There is therefore an interest in using basic network routing equipment to conduct tests, using basic tools such as “traceroute” and “ping”.

“Traceroute” is a technique which exploits the feature of Internet Protocol (IP) networks to generate a reply message to the sender of a message when a Time-To-Live (TTL) or hop-limit count expires.

“Ping” is a technique which can be used to test the reachability of nodes in a network, and to measure the round-trip time (RTT) for messages sent from an originating node (such as a computer, server, router, etc.) to a destination node and back. Messages in accordance with the Internet Control Message Protocol (ICMP), referred to as “ICMP probes”, “probe messages”, or simply “probes”, may be sent from a sender acting as a testing-point, generally via one or more intermediate nodes, to a remote network node which, if it is the intended destination of or “target” for the probe (generally indicated in header information included in the probe), sends an associated probe response message back to the sender, allowing the sender to confirm that the target has been reached and allowing the sender to measure the RTT (also known as latency).

In the present context and below, it will be noted that the word “probe” is generally used in the sense of an “investigation” or one or more “investigative messages”, rather than a “sensor”. The probes concerned may therefore be one or more packets, or one or more of another type of message sent via a network.

Techniques such as the above are commonly used to determine the nodes located along a network path and also to analyse latency or latency variation between pairs of nodes. Overall latency can determine how far away a node is, while the variation in latency, which may be caused by the filling of network queues, can be used as an indication of network congestion. Such techniques can provide a very fine-grained view of network performance at each node of every network path, allowing performance to be viewed by a network operator even in respect of nodes and paths across networks not under the operator's ownership or control.

A problem with such techniques is that results are not always reliable indicators of network performance. While actual network traffic passing through a node is generally handled in an optimised forwarding element of the node (“fast-path” processing), a “traceroute” response or “ping” will generally be handled by the node's general Central Processing Unit (CPU), and generally involves the generation of a new packet or other such message (“slow-path” processing). Traceroute and ping measurements thus often indicate delays and losses that are not actually experienced by forwarded user traffic.

As a result, previous attempts to determine network performance using basic router functions such as traceroute and ping have often been flawed due to the possibly slow or variable handling of these probes (i.e. probe packets or other messages) by standard network equipment such as routers and other nodes, leading to mis-diagnosis of network problems. Many systems have therefore used specialised testing infrastructure (e.g. dedicated test-servers), but as indicated above, these can generally only give overall end-to-end path performance between the test point and wherever these test-servers are located.

There is thus a need for improved ways of testing network performance which are applicable even when using basic probe techniques such as “traceroute” and “ping” in IP networks.

The “Center for Applied Internet Data Analysis” (“CAIDA”) has developed a tool called “Scamper” for use in a project referred to as the “Archipelago” project. This is intended to allows bulk traceroute and ping measurements. They have published the following papers:

-   “Challenges in Inferring Internet Interdomain Congestion” by M.     Luckie, A. Dhamdhere, D. Clark, B. Huffaker, & K. Claffy, Internet     Measurement Conference (IMC), November 2014, pages 15-22, which is     available online at:     https://www.caida.org/publications/papers/2014/challenges_inferring_interdomain_congestion/ -   and “Measurement and Analysis of Internet Interconnection and     Congestion” by D. Clark, S. Bauer, K. Claffy, A. Dhamdhere, B.     Huffaker, W. Lehr, & M. Luckie, Telecommunications Policy Research     Conference (TPRC), September 2014, which is available online at:     https://www.caida.org/publications/papers/2014/measurement_analysis_internet_interconnection/     These papers consider how data can be used to infer congestion,     particularly between network domains, and discuss how to analyse the     data to detect network problems.

Referring to other prior art citations, a paper entitled “Multipath Tracing with Paris Traceroute” (May 2007) authored by B. Augustin et al discusses traceroute, and how with the deployment of load balancing there is no longer a single route to a destination, hence classic traceroute systematically misses some paths. The paper specifies an adaptive, stochastic probing algorithm called the Multipath detection algorithm, to report all paths towards a destination.

A paper entitled “Rigorous Measurement of IP-level Neighborhood of Internet Core Routers” (March 2010) authored by C. Crespelle et al relates to the measurement of IP-level neighborhood of internet core routers, and proposed an approach dedicated to the core of the internet which is intended to avoid issues raised by classical measurements.

EP1206085 (“Infonet”) relates to methods and apparatus for automated service level agreements.

An IETF Network Working Group Internet Draft entitled “A Round-trip Delay Metric for IPPM” dated November 1998 and authored by G. Almes, S. Kalidindi and M. Zekauskas defines a metric for round-trip delay of packets across Internet paths.

A “Tech Notes” publication from Cisco Systems entitled “Understanding the Ping and Traceroute Commands” (http://www.cisco.com/image/gif/paws/12778/ping_traceroute.pdf) dated January 2010 illustrates the use of the ping and traceroute commands and, with the aid of some debug commands, captures a more detailed view of how these commands work.

US2010/315958 (“Luo et al”) relates to methods and apparatus for measuring network path quality in a non-cooperative manner, and involves sending a probe consisting of probe data packets to a remote node and receiving a response consisting of at least one response data packet therefrom.

SUMMARY OF THE INVENTION

The CAIDA papers discussed above discuss how to analyse data to detect network problems, but do not consider problems associated with specific nodes themselves having poor or variable response to network probes, let alone methods to deal with such problems.

Embodiments of the invention are based on the realisation that measurements made from sending a probe message such as a “Ping” message from a “testing” network node to a “target” network node, which are supposed to be indicative (at least primarily) of the performance of the network in respect of the path between the respective nodes, may also be influenced unduly by the time taken by the target node itself to perform local, on-board, “slow-path” processing of the probe message. Such “slow-path” processing generally only occurs in respect of probe messages where a node is the “target” node—if the same node is merely an intermediate node forwarding a probe message to a subsequent node which is the target node, it will generally only perform “fast-path” processing in respect of that probe message (i.e. to inspect its header and forward it). The present inventors have realised that this provides an opportunity to isolate and estimate the effect of a particular node's “slow-path” processing, and if it is estimated to be having a particularly damaging effect on the reliability of measurements where it is the target node, network performance analysis can be based (at least primarily) on other nodes whose own effect on probe measurements is less damaging.

According to a first aspect of the invention, there is provided a method of analysing network performance of a network comprising a plurality of network nodes, the method comprising, in respect of at least one target node:

-   -   obtaining a plurality of probe measurements, the probe         measurements in respect of said target node including:         -   at least one first-path probe measurement resulting from one             or more probe test-messages being sent via a first network             path from a testing node to said target node and one or more             associated probe response-messages triggered by receipt and             local processing at said target node of the one or more             probe test-message being received from said target node by             said testing node; and         -   at least one other-path probe measurement resulting from one             or more probe test-messages being sent via at least one             other network path from a testing node to said target node             and one or more associated probe response-messages triggered             by receipt and local processing at said target node of the             one or more probe test-messages being received from the             target node by said testing node;             the respective probe measurements each relating to one or             more network performance characteristics in respect of the             network paths taken by the respective probe test-messages             and the probe response-messages associated therewith and             being dependent also on the local processing of the             respective probe test-messages at said target node;     -   determining respective measures of unexpectedness in respect of         said at least one first-path probe measurement and in respect of         said at least one other-path probe measurement, said measures of         unexpectedness being determined according to a predetermined         function of said respective probe measurements; and     -   comparing said respective measures of unexpectedness and in         dependence on the comparison, assigning a weighting in respect         of said target node;         and:     -   determining a network performance analysis measure according to         a predetermined function dependent on at least one probe         measurement in respect of at least one target node and on the         weighting assigned in respect of said at least one target node.

Preferred embodiments may be used to identify whether a particular target node is likely to be providing unreliable results by comparing results obtained by sending probes to it via different network paths (which may be different paths from the same testing node or paths from different testing nodes). If it is found that results in respect of different paths to the same target node show unexpected commonality (e.g. results in respect of different paths exhibiting a shared or similar anomaly or sudden change at the same time as each other), this can be taken as a suggestion or strong indication that the results in respect of the different paths are all being influenced by the main factor they have in common (i.e. the common target node's “slow-path” processing), rather than the paths to the target node, suggesting that those results are unreliable, and should be discounted or given lower weight when analysing network performance.

The predetermined function may be chosen such that the overall performance analysis measure may be based on or most strongly based on the probe measurement(s) obtained in respect of a node from which the “best” measurement(s) was (were) obtained, or on one or more probe measurements subsequently obtained in respect of that node. It will be understood that the meaning of the term “best” will depend on the type of measurement being made, but in general, in relation to some types of measurements such as “time” measurements, the lowest will be deemed the best, whereas in relation to others, e.g. reliability or data volume measurements, the highest will be deemed the best.

The “return” network path taken by a probe response-message of a particular probe attempt will usually be the reverse of the “outward” network path taken by the associated probe test-message, but this will not necessarily be the case, and may not be a factor under the control of entities in control of the testing node or the target node in question.

According to preferred embodiments, the weighting assigned in respect of a target node may be determined in dependence on a measure of commonality exhibited between the respective measures of unexpectedness determined in respect of said at least one first-path probe measurement and in respect of said at least one other-path probe measurement. A lower weighting may be assigned in respect of a target node in respect of which the respective measures of unexpectedness exhibit higher commonality, for example.

The weightings may be “1” (i.e. full, or 100%) and “0” (i.e. zero, or 0%), in order either to include or exclude measurements in respect of particular target nodes in the overall analysis measure, or may be on a scale from 1 to 0 in order to allow the overall analysis measure to be influenced to a greater/lesser extent by measurements made in respect of target nodes deemed to be providing more/less reliable individual measurements.

According to preferred embodiments, the probe measurements in respect of a target node may include:

-   -   a plurality of first-path probe measurements each resulting from         a probe test-message being sent via said first network path from         a testing node to said target node and an associated probe         response-message triggered by receipt and local processing at         said target node of the probe test-message being received         (generally, but not necessarily via the first network path) from         said target node by said testing node; and     -   a plurality of other-path probe measurements each resulting from         a probe test-message being sent via said at least one other         network path from a testing node to said target node and an         associated probe response-message triggered by receipt and local         processing at said target node of the probe test-message being         received (generally, but not necessarily via the first network         path) from said target node by said testing node;         and the respective measures of unexpectedness may each be         determined according to a predetermined function of said         respective pluralities of probe measurements.

In such embodiments, the plurality of first-path probe measurements may result from probe test-messages being sent via said first network path to said target node at different times, and the plurality of other-path probe measurements may result from probe test-messages being sent via said other network path to said target node at different times.

Greater variation in results may suggest that they are less reliable, for example.

According to preferred embodiments, said one or more first-path probe measurements and said one or more other-path probe measurements may result respectively from one or more probe test-messages being sent via a first network path from a testing node and from one or more probe test-messages being sent via another network path from the same testing node.

The respective paths may be wireless and fixed paths between the same nodes, for example.

According to preferred embodiments, said one or more first-path probe measurements and said one or more other-path probe measurements result respectively from one or more probe test-messages being sent via a first network path from a first testing node and from one or more probe test-messages being sent via a network path from a different testing node.

According to preferred embodiments, each first-path probe measurements may result from a probe test-message being sent via a first network path from a first testing node to said target node and an associated probe response-message triggered by receipt and local processing at said target node of the probe test-message being received via the first network path from said target node by said testing node; and each other-path probe measurement may result from a probe test-message being sent via another network path from another testing node to said target node and an associated probe response-message triggered by receipt and local processing at said target node of the probe test-message being received via the other network path from said target node by said other testing node.

According to preferred embodiments, the probe measurements obtained in respect of the respective target nodes may include measurements in respect of one or more of the following:

-   -   one or more characteristics associated with response time (e.g.         round-trip response time to a “ping” message);     -   one or more characteristics associated with communication speed;     -   one or more characteristics associated with communication delay         and/or delay variation;     -   one or more characteristics associated with communication         volume;     -   one or more characteristics associated with reliability;     -   one or more characteristics associated with data loss;     -   one or more characteristics associated with communications         quality;     -   one or more characteristics associated with security;     -   one or more characteristics associated with service usage.         or one or more other types of characteristic.

According to a second aspect of the invention, there is provided a method of analysing network performance of a network comprising a plurality of network nodes, the method comprising performing a method according to the first aspect in respect of a plurality of target nodes whereby to assign respective weightings in respect of each of said plurality of target nodes, and determining a network performance analysis measure according to a predetermined function dependent on at least one probe measurement in respect of at least one of said target nodes and on the weighting assigned in respect of said at least one target node.

According to a third aspect of the invention, there is provided apparatus configured to perform a method in accordance with the first or second aspect.

The apparatus may comprise one or more network nodes such as routers, or one or more processors associated with one or more such nodes, for example.

According to a fourth aspect of the invention, there is provided a computer program element comprising computer program code to, when loaded into a computer system and executed thereon, cause the computer to perform the steps of a method according to the first aspect.

The various options and preferred embodiments referred to above in relation to the first aspect are also applicable in relation to the second, third and fourth aspects.

Preferred embodiments of the invention are able to utilise existing tests based upon existing functionality found in IP routers. Traceroute and ping are available as client tools along with more comprehensive tools such as scamper that allow bulk automation of traceroute and ping tests. Traceroute exploits the feature of IP networks to generate a reply to the sender when a Time-To-Live (TTL) expires. Ping reflects special ICMP probes to a network node back to the sender in order to test the round-trip-time (also known as latency).

Preferred embodiments of the invention are able to use such tools to produce individual test results for routers along a path from the test point. Such test results may record the time at which the test was executed, the IP node being tested, and performance data such as whether a response was returned along with the delay (or round-trip time) taken to respond.

These individual results may then be used to perform an analysis of the performance in respect of each of a number of nodes. The performance considered is commonly the overall (average) latency to reach the node as well as variation in the latency which might indicate congestion. The techniques developed by CAIDA discussed above can be used to look for diurnal variation in the latency which would be expected from peak-time network usage, however such diurnal variations can also exist in a node's response to traceroute and ping even when the network is not congested.

BRIEF DESCRIPTION OF THE DRAWINGS

Preferred embodiments of the present invention will be described with reference to the appended drawings, in which:

FIG. 1 shows a network node and two neighbouring nodes;

FIG. 2 shows several network nodes on a path;

FIG. 3 illustrates “fast-path” and “slow-path” processing at different nodes;

FIG. 4 illustrates the nodes and paths that may allow analysis using probe messages sent along different paths to the same target node in a method according to a preferred embodiment;

FIG. 5 illustrates possible results obtained from probes sent along different paths to the same target node that have a common unexpected anomaly;

FIG. 6 illustrates possible results obtained from probes sent along different paths to the same target node that do not have a common unexpected anomaly; and

FIG. 7 is a flow-chart illustrating a method according to a preferred embodiment in which measurements from probe messages sent along different paths to the same target node are analysed in order to identify questionable node data.

DESCRIPTION OF PREFERRED EMBODIMENTS OF THE INVENTION

With reference to the accompanying figures, methods and apparatus according to preferred embodiments will be described.

Before describing preferred embodiments of the invention, the issue of “slow-path” and “fast-path” processing in network nodes such as routers, referred to briefly above, will be explained in more detail with reference to FIGS. 1, 2 and 3.

Referring to FIG. 1, this shows a Network Node 10 and two Neighbouring Nodes 10′ and 10″, which are referred to respectively as being an “upstream” Node 10′ and a “downstream” Node 10″. Network Node 10 is shown expanded and in detail, with individual/internal functional modules shown (noting that these may be implemented as software or hardware modules, and noting that the separation between them may in fact be functional, rather than spatial), in order to assist with an explanation of the main functions thereof. The two neighbouring nodes 10′ and 10″ would generally have similar or corresponding individual/internal functional modules, but these are not shown in order to avoid unnecessarily complicating the figure.

It will be understood that the terms “upstream” and “downstream” are comparative, and depend on the role a particular node is playing in relation to a particular exchange of data—a first node can be upstream of a second node in relation to the path taken by one packet and downstream of the second node in relation to the path taken by another packet—but for the present discussion, these terms are used in relation to scenarios where:

-   -   (i) upstream node 10′ is sending data (e.g. one or more probe         messages, comprising one or more data packets) along a path via         node 10 to “downstream” network node 10″, in which case the         function of node 10 is to receive data from upstream node 10′         and forward it on to downstream node 10″; and     -   (ii) upstream node 10′ is sending data to node 10 itself and         receiving a response therefrom.

In FIG. 1, the solid arrows (H1, h1, h2, H2) relate to scenario (i), and indicate the one-way path taken by data sent from upstream node 10′ having downstream node 10″ as its (intended) destination address (as indicated in its header or otherwise), that reaches and is forwarded by node 10 on its path from upstream node 10′ to downstream node 10″. Of these arrows, those with a capital “H” (i.e. H1 and H2) indicate external hops on the path, i.e. the hop H1 between nodes 10′ and 10, and the hop H2 between nodes 10 and 10″. Those with a lower-case “h” (i.e. h1 and h2) indicate internal processing paths within node 10 for data received from node 10′ by a first input/output (I/O) interface 101 of node 10 and passed to the forwarding processor 103 of node 10 (h1), then passed from the forwarding processor 103 of node 10 (h2) to a second I/O interface 109 of node 10 which presents the data for forwarding from node 10 on to node 10″.

As indicated above, data packets in an IP network generally indicate their destination IP address (as well as their source address and other information) in their IP header, which would generally be used in relation to a “ping” test. For a traceroute request, the header may (also) indicate the Time-To-Live (TTL) hop count, but in this scenario, the target IP address might not be the same as the traceroute destination/target.

The dotted arrows (h3, h4, h5 and H3, and ignoring h1/3 and h4/5 for the time being) relate to scenario (ii), and together with solid arrows H1 and H3 indicate the two-way path taken when data is sent from upstream node 10′ having node 10 as its (intended) destination address, when that data reaches node 10 and is processed there, and when an associated response is sent by node 10 back to upstream node 10′. Again, arrows with a capital “H” (i.e. H1 and H3) indicate external hops on the path, i.e. the hop H1 between nodes 10′ and 10 (also performed in scenario (i)), and the hop H3 back from node 10 to node 10′. Those arrows with a lower-case “h” (i.e. h1, h3, h4 and h5) indicate internal processing paths within node 10 for data received from node 10′ by I/O interface 101 of node 10 and passed to the forwarding processor 103 of node 10 (h1, common to scenario (i)), which is found by node 10 to be targeted at node 10 itself, and which is therefore passed for processing by the CPU 105 of node 10 (h3), processed there, passed back to the forwarding processor 103 of node 10 (h4), passed from there back to I/O interface 101 of node 10 (h5) and presented for forwarding from node 10 back to node 10′ (H3). The CPU 105 is shown as having an associated memory 107, in which it may store information such as routing tables, the IP addresses of the interfaces, etc.

Thus, in relation to scenario (i), if node 10 is serving as an intermediate node between an upstream node 10′ and a downstream node 10″, and is therefore required merely to forward data such as a probe message from node 10′ on to node 10″, the path taken by the data is:

-   -   H1->h1->h2->H2

In relation to scenario (ii), however, if node 10 is serving as the target or destination node for data such as a probe message sent to it from upstream node 10′, and is therefore requested to send a probe response to the upstream node 10′ (so is therefore required to process the probe message in its CPU 105 before sending a response message back to node 10′, the path taken by the data is:

H1->h1->h3->h4->h5->H3

(NB In relation to the presently-described embodiment as described above, the I/O interfaces 101 and 109 of Node 10 serve simply as interfaces whose function is to forward data received from an external node (e.g. Node 10′ or Node 10″) to the forwarding processor 103, and to forward data received from the forwarding processor 103 to an external node (e.g. Node 10″ or 10′). It is the forwarding processor 103 whose function it is to inspect received data and, in the case of most data packets, including messages such as “ping” requests, determine (e.g. from reading a “destination address” indication in a header of a packet or other such message) whether the node itself is the intended destination for the data (in which case the data is passed to the CPU 105) or whether another node is the intended destination for the data (in which case the data is passed to the appropriate I/O interface for forwarding). (For “traceroute” tests, the issue may be whether a packet's header indicates an expired TTL, rather than whether the packet has reached its intended destination, however.) In any case, it will be noted however that curved dotted arrows referred to as “h1/3” and “h4/5” are shown in FIG. 1. These illustrate the situation in relation to alternative embodiments, in which the function of inspecting received data and determining whether the node itself is the intended destination for the data or whether another node is the intended destination for the data may be performed by the I/O interface receiving the data. In such embodiments, data requiring processing by the CPU 105 may be passed to it internally from the I/O interface 101 along the internal processing path indicated by curved dotted arrow h1/3, without passing through forwarding processor 103, and response data may be passed internally from the CPU 105 back along the path indicated by curved dotted arrow h4/5 to the I/O interface 101, again without passing through forwarding processor 103. The issue of “fast-path” and “slow-path” processing discussed above and below is applicable in relation to both types of embodiment.)

An important issue to note in relation to the above is that when forwarding a probe (such as a “traceroute” or “ping” message), a normal node (as opposed to a dedicated test-server) typically handles this in the same fashion as it handles other packets (NB it is said to be processed on the “fast path”, where the word ‘path’ here refers to an ‘internal processing path within the node’, rather than to a network path); the node is optimised for forwarding packets and the operation may be carried out entirely in hardware. However, when such a node responds to a probe (for instance, because the TTL of a traceroute packet has reached zero, or because the node is the target or intended destination of a “ping” packet), then the node is said to process the packet on the “slow path” (the word ‘path’ again referring to an ‘internal processing path within the node’); the “response” operation involves the node's CPU, and generally includes generation of a new packet/message which is sent back towards the source of the probe.

As a result of this, measurements of a characteristic relating to performance along a network path (e.g. round-trip response time or delay, variation in round-trip response time or delay, etc.) desired to be measured using one or more probe messages can be distorted by the “slow-path” processing of the probe message(s) on the probe's “target node” itself due to its internal processing, and in particular due to the speed, congestion-state, reliability or another characteristic of the CPU of the target node itself. If the performance measurement desired is one indicative of the performance state of the path between the testing node and the target node, distortion to such measurements being unduly influenced by the “slow-path” processing of the target node itself being unduly slow is generally undesirable.

It can thus be desirable to identify nodes causing (or deemed likely to be causing) significant distortion to individual probe measurements by virtue of their own “slow-path” processing and/or to identify nodes causing (or deemed likely to be causing) the least or most distortion, and therefore allow overall network analysis to be based at least primarily on probe measurements from one or more nodes found (or deemed likely) to be causing the least distortion, and possibly to allow measurements likely to have been more distorted to be removed or ignored from the overall network analysis.

In the interest of simplifying the explanation of the above issues, FIG. 1 only illustrates situations involving the minimum numbers of nodes necessary, but it will be understood that paths across networks may involve several nodes and hops therebetween, and networks are generally branched, so other routes between nodes may also be possible.

Further, while Node 10 is shown as having two I/O interfaces, a first one (101) for receiving data from and sending data to Node 10′, and second one (109) for receiving data from and sending data to Node 10″, a node may just have one interface for all sending and receiving, one interface for sending and another for receiving, several interfaces, one for each of a number of neighbouring nodes, or another such arrangement of interfaces.

With reference to FIG. 2, for example, which shows several network nodes on a path, it will be understood that a path across a network may generally have several intermediate nodes between an original sender (e.g. Test Source S, 20) of a message such as a probe message and the target for that data. For example if Node E, 20 e, is the target node for a probe message 22 e from Test Source S, and data travelling from Test Source S to Node E, is received and forwarded respectively by Nodes A, B, C, and D (20 a, 20 b, 20 c, 20 d) before reaching Node E, each of Nodes A, B, C and D acts as an intermediate node in respect of the probe message 22 e from Test Source S to Node E, and may also act as an intermediate node in respect of as associated response message 24 e from Node E back to Test Source S (although it should be noted that this “return” path may not necessarily be the reverse of the “outward” path). In such a scenario, the messages would be subjected to “fast-path” processing by each of Nodes A, B, C and D, and to “slow-path” processing only by Node E.

It will also be understood that while Test Source S is shown as sending probe messages 22 a, 22 b, 22 c, 22 d and 22 e to each of Nodes A, B, C, D and E (i.e. each acting as the Target Node in respect of the probe message sent thereto) and receiving associated response messages 24 a, 24 b, 24 c, 24 d and 24 e therefrom, any of the nodes shown may act as a Test Source and send probe messages to and receive associated response messages from any of the other nodes, at the same time or at different times, which may travel along any path linking the nodes, in either direction. Whether a particular node is involved in a particular probe attempt as a Test Source, as an intermediate node, or as a Target Node will determine whether its role will generally involve sending, forwarding, or receiving and responding to a probe message, which in turn will generally determine whether the particular node will process the probe only via its “fast-path” processing route (in order to send or forward the probe message downstream to another node, or forward a response message back towards the Test Source in question) or (additionally) via its “slow-path” processing route (in order to process the probe message in its own CPU, create a response message, and present this for transmittal back upstream towards the Test Source in question).

FIG. 3 illustrates how “fast-path” and “slow-path” processing may be performed at different nodes depending on whether the nodes are serving as the Target Node in respect of a particular probe or merely as an Intermediate Node on a path between a Test Source and a Target Node. For simplicity, it simply illustrates two probe messages being sent from a Test Source S, 30, one of which is sent with Node A, 30 a as its Target Node, and the other of which is sent with Node B, 30 b as its Target Node, along a path on which Node A, 30 a is an Intermediate Node. It will be understood that in different embodiments, the respective probe messages may be sent at the same time by Test Source S, 30, or at different times, that multiple messages may be sent to each Target Node, and that other nodes may also be involved as Test Sources, Intermediate Nodes and Target Nodes, at the same or at different times. This simple example will be used in order to explain how comparisons of different probe measurements made (using “ping”, “traceroute”, or other such probing techniques) may be made and used.

The individual functional modules of the nodes 30, 30 a and 30 b (i.e. the I/O Interfaces, the Forwarding Processors, the CPUs and their associated memories) are shown in abbreviated form where applicable, but as these have been explained earlier with reference to FIG. 1, they are not individually numbered in FIG. 3 so as not to over-complicate the figure. Dotted arrows have been used in FIG. 3 in order to show the paths concerned (i.e. the external hops between the nodes as well as the internal processing paths within the nodes) which are traversed in respect of the respective probes (i.e. the respective “outward” paths taken by the respective probe test-messages from the Test Source S to the respective Target Nodes, and the respective “return” paths taken by the respective probe response-messages from the respective Target Nodes back to the Test Source S), but again, these are not labelled as it is thought that this would make the figure unnecessarily complex.

With preferred embodiments of the invention, performance measurements obtained from different probe messages being sent on different paths and/or between different Test Sources and/or Target Nodes are compared in such a way as to indicate which measurements have been, or are likely to have been, unduly influenced by unduly slow, unreliable, misleading or otherwise poor “slow-path” processing in the node acting as the Target Node for the probe message in question. The results of such comparisons can be indicative of which node or nodes is/are responding in such a way as to provide genuine or realistic indications of performance on the network path in question.

Referring to the left-hand side of FIG. 3, consider that a probe from Test Source S to Node A involves the following elements being traversed in the course of allowing a single probe measurement to be made:

-   -   (i) the “outward” network path from the originating test-point,         Test Source S, to Node A (which itself comprises the dotted         arrows within Test Source S from its CPU and on to its I/O         interface to Node A, and the dotted arrow from the I/O interface         of Test Source S to the I/O interface of Node A, but this         sub-division is not of importance because the parts are common         to the left-hand side and the right-hand side of the figure);     -   (ii) the ingress interface on Node A from Test Source S;     -   (iii) the response processing in respect of the probe within         Node A (which itself is represented by the dotted arrows within         Node A from its I/O interface via its Forwarding Processor to         its CPU, and back via its Forwarding Processor to its I/O         interface);     -   (iv) the egress interface on Node A back towards Test Source S;         and     -   (v) the “return” network path to the Test Source S.

Simplifying the terminology, we can say the following:

Overall Node A measurement=Return path from S to A+Probe response of A

where the contribution referred to as “Return path from S to A” to the overall Node A measurement includes the following four sub-contributions:

-   -   (i) a sub-contribution relating to the “outward” network path         from the Test Source S to Node A;     -   (ii) a sub-contribution relating to the ingress interface on         Node A;     -   (iv) a sub-contribution relating to the egress interface on Node         A back towards Test Source S; and     -   (v) a sub-contribution relating to the “return” network path         from Node A to Test Source S.

It will be noted that the only part of the overall measurement not also forming part of the “Return path from S to A” contribution is that relating to (iii) above, i.e. the response processing in respect of the probe within Node A itself.

Now, with reference to the right-hand side of FIG. 3, consider a probe from the same Test Source S to subsequent Node B, 30 b, sent via Node A, 30 a. This measures the same elements as the probe to Node A except for the “slow-path” response processing in respect of the probe within Node A itself (as the probe to Node B is merely forwarded across Node A, via its “fast path” processing, rather than processed by the CPU of Node A via its “slow path” processing, but in addition, it now also includes the network path between Node A and Node B (“outward” and “return” contributions, as represented by the dotted arrows between Node A and Node B) and the probe response of Node B itself (represented by the dotted arrows within Node B from its I/O interface via its Forwarding Processor to its CPU, and back via its Forwarding Processor to its I/O interface).

Using the same convention as above, the contributions of overall measurements can be regarded as follows:

Overall Node B measurement=Return path from S to B+Probe response of B

Overall Node B measurement=Return path from S to A+Return path between A and B+Probe response of B

Overall Node B measurement=Overall Node A measurement−Probe response of Node A return path between Node A and Node B+Probe response of Node B

and

Overall Node B measurement−Overall Node A measurement=Return path between Node A and Node B+Probe response of Node B−Probe response of Node A

It can be seen from the above that the performance (which may be measured in terms of speed, throughput, reliability, consistency or any of a variety of other types of characteristic) seen when Node B is the Target Node will not always be slower, longer, smaller, larger, or otherwise worse (depending on the type of performance characteristic in question) than that seen when Node A is the Target Node (e.g. if the Node A probe response is unduly slow). However, any network performance of the path to Node A must be included in the performance seen at Node B. Thus, while it may not be possible to isolate clearly or completely the network performance to Node A, it is possible to identify node measurements that strongly appear to be compromised by the probe response time of Node A if, for example, a round-trip time measurement in respect of a probe from Test Source S to Node A has a greater RTT than a concurrent measurement in respect of a probe from the same Test Source S via Node A to subsequent Node B.

Analysis Using Multiple Paths to Same Target Node (i.e. from Same Node or Different Nodes)

Instead of analysing different nodes on the same path (i.e. such as in the situation described above with reference to FIG. 3), we can instead compare results in respect of a single node from probes sent along two or more different paths. This is most powerful if the paths are entirely disjoint, but can still work to a degree if the paths share some equipment (e.g. the final hop or hops, or an interface on the Target Node, for example).

This approach preferably involves looking at measurements from multiple test points. One example may be examining paths from test points on either side of a Target Node. Alternatively, this approach may involve looking at measurements relating to multiple paths from a single test point to the same target Node, e.g. where broadband and wireless connections exist.

The premise is that while each of these measurements will have different network delays and failures, the delay in responding to the probe message at the Target Node itself is likely to be very similar, even if these probes arrive on different interfaces, because both will rely on “slow-path” processing within the Target Node itself. Therefore if all paths show a similar signature it is likely that this is due to delays in the node itself responding.

This can be further reinforced by also looking at preceding and subsequent nodes (as set out with reference to FIG. 3). For example if all paths have low delays and then show a sudden increase at a single node despite not sharing any network infrastructure, it can be concluded more confidently that the measurements to that node are questionable for network analysis.

The following explanation is given in relation to a network such as that shown in FIG. 4, which illustrates the nodes and paths that may allow analysis using probe messages sent along different paths to the same Target Node. Five nodes are shown. While five such nodes could serve as a single path (e.g. between Test Source S1, 40, and Test Source S2, 40 d), they will, for the purpose of this explanation, be regarded as being two different paths, one between Test Source S1, 40 and Node B, 40 b, and another between Test Source S2, 40 d and Node B, 40 b. It will serve to illustrate how tests can be made along different paths to/from the same Target Node. It should be noted that the different paths may be from different Test Sources, as is shown in the figure, and as will be described, but in alternative embodiments (not shown), the different paths may be paths via from different Intermediate Nodes from the same Test Source.

As with FIG. 3 above, FIG. 4 illustrates “fast-path” and “slow-path” processing are performed at different nodes depending on whether those nodes are serving as the Target Node in respect of a particular probe or merely as an Intermediate Node on a path between a Test Source and a Target Node. For simplicity, it illustrates two probe messages being sent, one from a Test Source S1, 40, via Intermediate Node A, 40 a to the common target node, Node B, 40 b, and another from a different Test Source S2, 40 d via Intermediate Node C, 40 c, to the common target node, Node B, 40 b.

It will be understood that in different embodiments, the respective probe messages may be sent at the same time by the Test Source S1 and S2, or at different times, that multiple messages may be sent by each to the common Target Node B, and that other nodes may also be involved as Test Sources, Intermediate Nodes and Target Nodes, at the same or at different times. This simple example will be used in order to explain how comparisons of different probe measurements made in respect of different paths to the same Target Node (using “ping”, “traceroute”, or other such probing techniques) may be made and used.

The individual functional modules of the nodes 40, 40 a, 40 b, 40 c and 40 d (i.e. the I/O Interfaces, the Forwarding Processors, the CPUs and their associated memories) are shown in abbreviated form where applicable, but as these have been explained earlier with reference to FIG. 1, they are not individually numbered in FIG. 4 so as not to over-complicate the figure. Dotted arrows have been used in FIG. 4 in order to show the paths concerned (i.e. the external hops between the nodes as well as the internal processing paths within the nodes themselves) which are traversed in respect of the respective probes (i.e. the respective “outward” paths taken by the respective probe test-messages from the respective Test Sources S1 and S2 to the Target Node B, and the respective “return” paths taken by the respective probe response-messages from the Target Node B back to the respective Test Sources S1 and S2), but again. The two-way or “round-trip” paths over which respective measurements are made by the respective test Sources are referred to on the right of the figure as the “First-Path Measurement” (i.e. the measurement relating to the round-trip “S1-B-S1”) and the “Second-Path Measurement” (i.e. the measurement relating to the round-trip “S2-B-S2”).

With preferred embodiments, performance measurements made/obtained in respect of probe messages sent along different paths to the same Target Node are compared in order to investigate the performance of a particular network node. As indicated, the measurements may be ping or traceroute measurements which provide measures of the round-trip response times from different Test Sources to the Target Node and back. Each response time includes the delay from the probe and associated response messages being forwarded across the network, plus the delay from the processing on the Target Node itself to generate the response.

It would generally be expected that some paths will have legitimately higher delay (e.g. because they are longer) or higher delay variation due to queuing delays, particularly at times of higher network usage. Based on theoretical knowledge and observation of other Nodes on similar paths, each path to the Target Node can be analysed to determine how expected or unexpected the results are. A result may be unexpected because the overall level is far higher or more variable than a model would suggest, or because it differs (significantly) from the majority of results for the path in question, or from results obtained shortly before and/or shortly after in respect of the path in question, for example. By analysing results against time, it may also be possible to identify periods that exhibit the unexpected behaviour more than others. From this, it can generally only be concluded that the results of probes along a path to the Target Node are surprising, not that the “slow-path” processing on the target Node is responsible for the surprising results, however.

By comparing multiple paths to the same Target Node, a determination can be made as to whether the surprising behaviour along one path is also exhibited along one or more other paths to the same Target Node. Preferably the respective paths would be completely disjoint, allowing a justified conclusion to be drawn that any “shared” surprising behaviour is probably due to processing within the Target Node itself, it being the only shared element of the respective paths. If paths share some network segment (e.g. the interface on the Target Node being analysed) then the unexpected behaviour may be assumed to come either from the interface (which could be considered a legitimate measure for network performance analysis) or from the processing on the Target Node.

If both/all paths to the Target Node show the same surprising behaviour then it can be concluded with some degree of confidence that the processing on the Target Node is responsible for the unexpected behaviour since the probability of all paths being affected in the same unexpected way is small. If not, it can be concluded with some degree of confidence that the measurements obtained are indicative of performance in respect of the respective paths between the Test Sources and the Target Node.

Possible results of the above two types are illustrated in FIGS. 5 and 6. In these, the paths are shown respectively as P1 and P2 for simplicity.

FIG. 5 illustrates possible results which may be obtained from probes sent along different paths to the same target node that have a shared unexpected anomaly, this being the small peak that appears in each plot of the metric against time.

FIG. 6 illustrates possible results obtained from probes sent along different paths to the same target node that do not have a shared unexpected anomaly.

The computation of how surprising results along a path are can be performed in various ways. The results can be compared with either a theoretical or empirical model of expected performance. A simple method may be to measure the difference between the expected and observed results for both the overall levels and the variation. This can be improved by comparing the different paths at each unit of time. While the results overall may conform fairly well to the model, at any point in time the performance may be much more anomalous.

When comparing two paths, a determination could be made as to whether both/all paths have the same overall level of abnormality. In practice it is better to compare if paths have the same abnormality at the same time. While some Node processing may provide continuously higher or variable response, other Nodes will exhibit different levels of processing delay/variability depending on other processes on the Node. The impact of these processing delays should therefore be seen at the same time for different paths to the Node.

Methods in accordance with a preferred embodiment will now be described with reference to FIG. 7, which is a flow-chart illustrating a method according to a preferred embodiment in which measurements from probe messages sent along different paths to the same target node are analysed in order to identify questionable node data.

For this explanation, we will consider measurements of round-trip time (RTT) obtained by “ping” probes, but it will be understood that others characteristics may be measured using other probe techniques. We will consider an embodiment in which batches of probe measurements in respect of different paths to several different possible Target Nodes may be collected, but it will be understood that in other embodiments, the process may simply perform the analysis in relation to one “Target Node” at a time.

If using a model of expected path performance, instead of or as well as relying on comparisons of measurements at different times, for example, the model can be obtained or produced at step s70, in order to enable the unexpectedness of path results to be rated in dependence thereon.

In a preferred embodiment, probe measurements are collected in respect of the respective paths to the (or each) Target Node (step s70), and one Target Node (e.g. Node B in FIGS. 4, 5 and 6) is selected for analysis (step s71).

Probe measurements involving different paths to the selected Target Node (e.g. paths P1 and P2 from different Test Sources S1 and S2 in FIGS. 5 and 6) are then identified and partitioned by path (step s73).

At step s74, the unexpectedness of the result(s) in respect of each path is rated, by comparing the result(s) in respect of the path to the model of expected path performance if this is available, by comparing different results in respect of the same path if multiple results are available per path, or otherwise.

At step s74, the unexpectedness ratings obtained for the respective paths to the Target Node are compared.

If it is found (at step s76) that the path measurements for the respective paths show unexpected strong commonality, it can be concluded (at step s80) that measurements in respect of the Target Node are at least questionable, as the commonality is more likely to be due to internal (i.e. “slow-path”) processing issues on the node itself, rather than performance issues (coincidentally) affecting both/all of the paths between the Test Source(s) and the Target Node. The measurements may be used, possibly with a low weighting in a combined measurement, and the process can then return to step s72 and select a new Target Node for analysis if it is found at step s79 that measurements from other Target Nodes are available, or to step s71 if not, in order to collect further measurements.

If it is found (at step s76) that the path measurements for the respective paths show do not show unexpected strong commonality, it can be concluded (at step s77) that measurements in respect of the Target Node are at least possibly valid, as the lack of commonality suggests that the path measurements obtained are not being unduly influenced by internal processing issues, and are therefore likely to be indicative of performance issues on one or more of the individual paths between the Test Source(s) and the Target Node. In this case, a positive weighting, which may be “1” or a value between “0” and “1”, may be assigned to the Target Node, or to the measurements obtained in respects of paths thereto, indicating that such measurements can be used in the overall determination of a network performance measure.

The process then continues to step s78, at which an overall Network Performance Measure can be determined based on measurements already or subsequently obtained with that Target Node (and any others in respect of which a positive weighting has been assigned, for example).

If it is found (at step s79) that measurements based on one or more other nodes as “Target Node” are available, the process may return to step s72 and be repeated from there in respect thereof, or it may return to s71 and be repeated with newly-collected measurements.

Insofar as embodiments of the invention described are implementable at least in part using a software-controlled programmable processing device, such as a microprocessor, digital signal processor or other processing device, data processing apparatus or system, it will be appreciated that a computer program for configuring a programmable device, apparatus or system to implement the foregoing described methods is envisaged as an aspect of the present invention. The computer program may be embodied as source code or undergo compilation for implementation on a processing device, apparatus or system or may be embodied as object code, for example.

Suitably, the computer program is stored on a carrier medium in machine or device readable form, for example in solid-state memory, magnetic memory such as disk or tape, optically or magneto-optically readable memory such as compact disk or digital versatile disk etc., and the processing device utilises the program or a part thereof to configure it for operation. The computer program may be supplied from a remote source embodied in a communications medium such as an electronic signal, radio frequency carrier wave or optical carrier wave. Such carrier media are also envisaged as aspects of the present invention.

It will be understood by those skilled in the art that, although the present invention has been described in relation to the above described example embodiments, the invention is not limited thereto and that there are many possible variations and modifications which fall within the scope of the invention.

The scope of the present invention includes any novel features or combination of features disclosed herein. The applicant hereby gives notice that new claims may be formulated to such features or combination of features during prosecution of this application or of any such further applications derived therefrom. In particular, with reference to the appended claims, features from dependent claims may be combined with those of the independent claims and features from respective independent claims may be combined in any appropriate manner and not merely in the specific combinations enumerated in the claims. 

1) A method of analysing network performance of a network comprising a plurality of network nodes, the method comprising, in respect of at least one target node: obtaining a plurality of probe measurements, the probe measurements in respect of said target node including: at least one first-path probe measurement resulting from one or more probe test-messages being sent via a first network path from a testing node to said target node and one or more associated probe response-messages triggered by receipt and local processing at said target node of the one or more probe test-message being received from said target node by said testing node; and at least one other-path probe measurement resulting from one or more probe test-messages being sent via at least one other network path from a testing node to said target node and one or more associated probe response-messages triggered by receipt and local processing at said target node of the one or more probe test-messages being received from the target node by said testing node; the respective probe measurements each relating to one or more network performance characteristics in respect of the network paths taken by the respective probe test-messages and the probe response-messages associated therewith and being dependent also on the local processing of the respective probe test-messages at said target node; determining respective measures of unexpectedness in respect of said at least one first-path probe measurement and in respect of said at least one other-path probe measurement, said measures of unexpectedness being determined according to a predetermined function of said respective probe measurements; and comparing said respective measures of unexpectedness and in dependence on the comparison, assigning a weighting in respect of said target node; and; determining a network performance analysis measure according to a predetermined function dependent on at least one probe measurement in respect of at least one target node and on the weighting assigned in respect of said at least one target node. 2) A method according to claim 1 wherein the weighting assigned in respect of a target node is determined in dependence on a measure of commonality exhibited between the respective measures of unexpectedness determined in respect of said at least one first-path probe measurement and in respect of said at least one other-path probe measurement. 3) A method according to claim 2 wherein a lower weighting is assigned in respect of a target node in respect of which the respective measures of unexpectedness exhibit higher commonality. 4) A method according to claim 1 wherein the probe measurements in respect of a target node include: a plurality of first-path probe measurements each resulting from a probe test-message being sent via said first network path from a testing node to said target node and an associated probe response-message triggered by receipt and local processing at said target node of the probe test-message being received from said target node by said testing node; and a plurality of other-path probe measurements each resulting from a probe test-message being sent via said at least one other network path from a testing node to said target node and an associated probe response-message triggered by receipt and local processing at said target node of the probe test-message being received from said target node by said testing node; and wherein the respective measures of unexpectedness are each determined according to a predetermined function of said respective pluralities of probe measurements. 5) A method according to claim 4 wherein said plurality of first-path probe measurements result from probe test-messages being sent via said first network path to said target node at different times, and said plurality of other-path probe measurements result from probe test-messages being sent via said other network path to said target node at different times. 6) A method according to claim 1 wherein said one or more first-path probe measurements and said one or more other-path probe measurements result respectively from one or more probe test-messages being sent via a first network path from a testing node and from one or more probe test-messages being sent via another network path from said testing node. 7) A method according to claim 1 wherein said one or more first-path probe measurements and said one or more other-path probe measurements result respectively from one or more probe test-messages being sent via a first network path from a first testing node and from one or more probe test-messages being sent via a network path from a different testing node. 8) A method according to claim 1 wherein each first-path probe measurement results from a probe test-message being sent via a first network path from a first testing node to said target node and an associated probe response-message triggered by receipt and local processing at said target node of the probe test-message being received via the first network path from said target node by said testing node; and wherein each other-path probe measurement results from a probe test-message being sent via another network path from another testing node to said target node and an associated probe response-message triggered by receipt and local processing at said target node of the probe test-message being received via the other network path from said target node by said other testing node. 9) A method according to claim 1 wherein the probe measurements obtained in respect of the respective target nodes include measurements in respect of one or more of the following: one or more characteristics associated with response time; one or more characteristics associated with communication speed; one or more characteristics associated with communication delay and/or delay variation; one or more characteristics associated with communication volume; one or more characteristics associated with reliability; one or more characteristics associated with data loss; one or more characteristics associated with communications quality; one or more characteristics associated with security; one or more characteristics associated with service usage. 10) A method of analysing network performance of a network comprising a plurality of network nodes, the method comprising performing a method according to claim 1 in respect of a plurality of target nodes whereby to assign respective weightings in respect of each of said plurality of target nodes, and determining a network performance analysis measure according to a predetermined function dependent on at least one probe measurement in respect of at least one of said target nodes and on the weighting assigned in respect of said at least one target node. 11) Apparatus configured to perform a method in accordance with claim
 1. 12) A computer program element comprising computer program code to, when loaded into a computer system and executed thereon, cause the computer to perform the steps of a method as claimed in claim
 1. 